Easier proofs of coloring theorems
نویسنده
چکیده
We present a simpler proof of the known theorem that a fixed-point free homeomorphism on an n-dimensional paracompact space can be colored with n+ 3 colors. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Stability for Extremal Hypergraphs with Applications to an Edge-coloring Problem – Proofs of Theorems 1.2 and 1.3
This file contains the proofs of Theorems 1.2 and 1.3.
متن کاملGeneralized Kneser Coloring Theorems with Combinatorial Proofs
The Kneser conjecture (1955) was proved by Lovász (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions. Only in 2000, Matoušek provided the first combinatorial proof of the Kneser conjecture. Here we provide a hypergraph coloring theorem, with a combinatorial proof...
متن کاملCombinatorial Proofs of Some Theorems in Algebraic Topology
Two important theorems in algebraic topology are the Brouwer Fixed Point theorem and the Borsuk-Ulam theorem. The theorems require the development of homology in their standard proofs. However, each theorem has an equivalent combinatorial result involving triangulating the relevant surface and coloring the vertices of the triangulation. Then by taking the limit of a sequence of finer triangulat...
متن کاملShort proofs of classical theorems
We give proofs of Ore’s theorem on Hamilton circuits, Brooks’ theorem on vertex coloring, and Vizing’s theorem on edge coloring, as well as the Chvátal-Lovász theorem on semi-kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orientations of graphs. These proofs, while not radically different from existing ones, are perhaps simpler and more...
متن کاملA Generic NP-hardness Proof for a Variant of Graph Coloring
In this note, a direct proof is given of the NP-completeness of a variant of Graph Coloring, i.e., a generic proof is given, similar to the proof of Cook of the NPcompleteness of Satisfiability. Then, transformations from this variant of Graph Coloring to Independent Set and to Satisfiability are given. These proofs could be useful in an educational setting, where basics of the theory of NP-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999